Exact and Near Pareto Optimal Solutions for Total Completion Time and Total Late Work Problem

نویسندگان

چکیده

In this paper, the bi-criteria machine scheduling problems (BMSP) are solved, where discussed problem is represented by sum of completion and late work times simultaneously. order to solve suggested BMSP, some metaheurisitc methods which produce good results. The local search simulated annulling bees algorithm. results new compared with complete enumeration method, considered an exact then heuristics each other obtain most efficient method.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

متن کامل

A Hybrid Genetic Algorithm for the Open Shop Scheduling with Makespan and Total Completion Time

Proper scheduling of tasks leads to optimum using of time and resources, in order to obtaining best result. One of the most important and complicated scheduling problems is open shop scheduling problem. There are n jobs in open shop scheduling problem which should be processed by m machines. Purpose of scheduling open shop problem is attaining to a suitable order of processing jobs by specified...

متن کامل

An exact extended formulation for the unrelated parallel machine total weighted completion time problem

Abstract: The plethora of research on NP-hard parallel machine scheduling problems is focused on heuristics due to the theoretically and practically challenging nature of these problems. Only a handful of exact approaches are available in the literature, and most of these suffer from scalability issues. Moreover, the majority of the papers on the subject are restricted to the identical parallel...

متن کامل

Exact and Heuristic Solutions to Minimize Total Waiting Time in the Blood Products Distribution Problem

This paper presents a novel application of operations research to support decision making in blood distribution management. The rapid and dynamic increasing demand, criticality of the product, storage, handling, and distribution requirements, and the different geographical locations of hospitals and medical centers have made blood distribution a complex and important problem. In this study, a r...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Iraqi journal of science

سال: 2023

ISSN: ['0067-2904', '2312-1637']

DOI: https://doi.org/10.24996/ijs.2023.64.7.29